New filtering algorithms for combinations of among constraints
نویسندگان
چکیده
منابع مشابه
Filtering Algorithms for Tabular Constraints
Constraint satisfaction technology supports all constraint types, i.e. arbitrary relations can be expressed, theoretically. However, in practice constraint packages support only some constraints, namely arithmetical, logical, and special purpose global constraints. If a general relation constraint needs to be expressed, the user is forced to represent it as a system of supported constraints or ...
متن کاملFiltering algorithms for global chance constraints
Stochastic Constraint Satisfaction Problems (SCSPs) are a powerful modeling framework for problems under uncertainty. To solve them is a P-Space task. The only complete solution approach to date — scenario-based stochastic constraint programming — compiles SCSPs down into classical CSPs. This allows the reuse of classical constraint solvers to solve SCSPs, but at the cost of increased space req...
متن کاملSynthesizing Filtering Algorithms for Global Chance-Constraints
Stochastic Constraint Satisfaction Problems (SCSPs) are a powerful modeling framework for problems under uncertainty. To solve them is a P-Space task. The only solution approach to date compiles down SCSPs into classical CSPs. This allows the reuse of classical constraint solvers to solve SCSPs, but at the cost of increased space requirements and weak constraint propagation. This paper tries to...
متن کاملGlobal Constraints and Filtering Algorithms
Constraint programming (CP) is mainly based on filtering algorithms; their association with global constraints is one of the main strengths of CP. This chapter is an overview of these two techniques. Some of the most frequently used global constraints are presented. In addition, the filtering algorithms establishing arc consistency for two useful constraints, the alldiff and the global cardinal...
متن کاملFiltering Algorithms for the Same and UsedBy Constraints
We define the Same and UsedBy constraints. UsedBy takes two sets of variables X and Z such that jX j jZj and assigns values to them such that the multiset of values assigned to the variables in Z is contained in the multiset of values assigned to the variables in X . Same is the special case of UsedBy in which jX j = jZj. We show algorithms that achieve arc-consistency and boundconsistency for ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Constraints
سال: 2009
ISSN: 1383-7133,1572-9354
DOI: 10.1007/s10601-008-9067-7